Efficient algorithms for two generalized 2-median problems and the group median problem on trees

Efficient Algorithms for Two Generalized 2-Median Problems on Trees

The p-median problem on a tree T is to find a set S of p vertices on T that minimize the sum of distances from T’s vertices to S. For this problem, Tamir [14] had an O(pn)-time algorithm, while Gavish and Sridhar [6] had an O(nlog n)-time algorithm for the case of p=2. In this paper, we study two generalizations of the 2-median problem, which are obtained by imposing constraints on a 2-median: ...

An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

The k-Median Problem for Directed Trees

Heuristics for the generalized median graph problem

Structural approaches for pattern recognition frequently make use of graphs to represent objects. The concept of object similarity is of great importance in pattern recognition. The graph edit distance is often used to measure the similarity between two graphs. It basically consists in the amount of distortion needed to transform one graph into the other. The median graph of a set S of graphs i...

The p-median and p-center Problems on Bipartite Graphs

Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...